Continuous Foraging and Information Gathering in a Multi-Agent Team

نویسندگان

  • Somchaya Liemhetcharat
  • Rui Yan
  • Keng Peng Tee
چکیده

We are interested in continuous foraging with multi-agent teams, where resources are replenished over time, and the goal is to maximize the rate of foraging. Existing algorithms for continuous foraging and area sweeping typically consider homogeneous agents. We are interested in heterogeneous teams, where agents have radically different capabilities. In particular, we consider two types of agents: a foraging agent that moves in the environment and forages resources, and a reconnaissance agent that gathers information by visiting locations and determining the number of resources available. In this paper, we consider three models of resource replenishment: a Bernoulli model and a Poisson model where resources appear probabilistically, and a stochastic Logistic model where resources increase based on the existing number of resources. We contribute three foraging algorithms that are inspired by existing algorithms, and contribute a novel algorithm for the reconnaissance agent to gather information. We extensively evaluate our algorithms in simulation, showing that our foraging algorithms outperform the existing algorithms. We demonstrate the efficacy of our information gathering algorithm in improving the overall team performance, even without communication between the foraging agents, and with noisy observations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Agent Continuous Transportation with Online Balanced Partitioning

We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a transportation hub. The goal is to maximize the rate of transportation while the objects are replenished over time . In this extended abstract, we present...

متن کامل

Multi-Agent Continuous Transportation with Online Balanced Partitioning: (Extended Abstract)

We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a transportation hub. The goal is to maximize the rate of transportation while the objects are replenished over time . In this extended abstract, we present...

متن کامل

A Decentralized Ant Colony Foraging Model Using Only Stigmergic Communication

This paper addresses the problem of foraging by a coordinated team of robots. This coordination is achieved by markers deposited by robots. In this paper, we present a novel decentralized behavioral model for multi robot foraging named cooperative c-marking agent model. In such model, each robot makes a decision according to the affluence of resource locations, either to spread information on a...

متن کامل

A Hybrid Modeling for Continuous Casting Scheduling Problem

This paper deals with a multi-agent-based interval type-2 fuzzy (IT2F) expert systemfor scheduling steel continuous casting. Continuous caster scheduling is a complex and extensiveprocess that needs expert staff. In this study, a distributed multi-agent-based structure is proposed as asolution. The agents used herein can cooperate with each other via various communication protocols.To facilitat...

متن کامل

Coordination Approach to Find Best Defense Decision with Multiple Possibilities among Robocup Soccer Simulation Team

In 2D Soccer Simulation league, agents will decide based on information and data in their model. Effective decisions need to have world model information without any noise and missing data; however, there are few solutions to omit noise in world model data; so we should find efficient ways to reduce the effect of noise when making decisions. In this article we evaluate some simple solutions whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015